A Calculus for Timed Automata
نویسندگان
چکیده
A language for representing timed automata is introduced. Its semantics is deened in terms of timed automata. This language is complete in the sense that any timed automaton can be represented by a term in the language. We also deene a direct operational semantics for the language in terms of (timed) transition systems. This is proven to be equivalent (or, more precisely, timed bisimilar) to the interpretation in terms of timed automata. In addition, a set of axioms is given that is shown to be sound for timed bisim-ulation. Finally, we introduce several features like hiding operator, the parallel composition and derived time operations like wait, time-out and urgency. We conclude with an example and show that we can eliminate non-reachable states using algebraic techniques.
منابع مشابه
Using Interval Petri Nets and Timed Automata for Diagnosis of Discrete Event Systems (DES)
A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown irregular intervals, of physical events. Because of the special nature of these systems, different tools are currently used for their analysis, design and modeling. The main focus of this paper is the presentation of a new modeling approach of Discrete Event Systems. The ...
متن کاملA Complete Axiomatisation for Timed Automata
A proof system of timed bisimulation equivalence for timed automata is presented, based on a CCS-style regular language for describing timed automata. It consists of the standard monoid laws for bisimulation and a set of inference rules. The judgments of the proof system are conditional equations of the form t = u where is a clock constraint and t, u are terms denoting timed automata. The proof...
متن کاملUrri 6 \ Vwhp Iru 7 Lphg $ Xwrpdwd + Xlplq / Lq : Dqj
A proof system for timed automata is presented, based on a CCS-style language for describing timed automata. It consists of the standard monoid laws for bisimulation and a set of inference rules. The judgments of the proof system are conditional equations of the form t = u where is a clock constraint and t, u are terms denoting timed automata. It is proved that the proof system is complete over...
متن کاملOn Checking Timed Automata for Linear Duration Invariants
In this work, we address the problem of verifying a Timed Automaton for a real-time property written in Duration Calculus in the form of Linear Duration Invariants. We present a conservative method for solving the problem using the linear programming techniques. First, we provide a procedure to translate Timed Automata to a sort of regular expressions for timed languages. Then, we extend the li...
متن کاملOn Improving Backwards Verification of Timed Automata ( Extended Abstract )
Verification techniques for Timed Automata [2] built in tools like Kronos [7] are based on the fixpoint calculus of an appropriate operator. In this work, we present different alternatives to calculate that fixpoint, which have direct impact in the number of iterations needed to converge.
متن کاملComputer Science at Kent From LIDL to Timed Automata
LIDL− is a decidable fragment of Interval Duration Logic with Located Constraints, an expressive subset of dense-time Duration Calculus. It has been claimed that, for any LIDL− formulaD, a timed automaton can be constructed which accepts the models of D. However, the proposed construction is incomplete and has not been proved effective. In this paper, we prove the effective construction of equi...
متن کامل